A Queueing Model for Wormhole Routing with Finite Buffers

Analytical models for wormhole routing in hypercube have widely been reported in the literature. Most of these models, however, have assumed negligible input buffer sizes. Hu and Kleinrock in [8] have proposed an analytical model that captures the effect of finite input buffer size for irregular high-speed LANs while Kouvatsos, Assi, and Ould-Khaoua [11] have very recently proposed a model based on results from the maximum entropy method (MEM). In this paper, we develop an alternative analytical model for wormhole routing with finite buffers based on M/G/1 queueing systems. The validity of our new model is demonstrated by comparing analytical results with those obtained from simulation experiments for the hypercube topology.